Disambiguation of Super Parts of Speech ( or Supertags ) : Almost
نویسنده
چکیده
In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a lexicalized grammar must search a large set of supertags to choose the right ones to combine for the parse of the sentence. We present techniques for disambiguating supertags using local information such as lexical preference and local lexical dependencies. The similarity between LTAG and Dependency grammars is exploited in the dependency model of supertag dis-ambiguation. The performance results for various models of supertag disambiguation such as unigram, trigram and dependency-based models are presented.
منابع مشابه
Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing
In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a lexicalized grammar must search a large set of supertags to choose the right ones to combine for the parse of the sentence. We present techniques for disambi...
متن کاملDisambiguation of Super Parts of Speech (or Supertags): Allnost Parsing
In a lexicalized grammar Ibrnlal-isni such as LexicMized Tree-Adjoining (h'~unmar (I3'AG), each lexicM item is associated with at least one elementary structure (supertag) that localizes syntactic a.nd semantic dependencies. Thus a parser for a lexicalized grammar must search a large set of supertags to choose the right ones to combine for the parse of the sentence. We present techniques I'or d...
متن کاملThe Institute For Research In Cognitive Science Disambiguation of Super Parts
In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a lexicalized grammar must search a large set of supertags to choose the right ones to combine for the parse of the sentence. We present techniques for disambi...
متن کاملComplexity of Lexical Descriptions and its Relevance to Partial Parsing
Complexity of Lexical Descriptions and its Relevance to Partial Parsing Srinivas Bangalore Supervisor: Aravind K. Joshi In this dissertation, we have proposed novel methods for robust parsing that integrate the exibility of linguistically motivated lexical descriptions with the robustness of statistical techniques. Our thesis is that the computation of linguistic structure can be localized if l...
متن کاملSupertagging: An Approach To Almost Parsing
In this paper, we have proposed novel methods for robust parsing that integrate the exibility of linguistically motivated lexical descriptions with the robustness of statistical techniques. Our thesis is that the computation of linguistic structure can be localized if lexical items are associated with rich descriptions (Supertags) that impose complex constraints in a local context. The supertag...
متن کامل